SYSTEMS OF PHONEMES AND COLORED GRAPHSNEBESKY L.ACTA UNIVERSITATIS CAROLINAE. PHILOLOGICA. PHONETICA PRAGENSIA. 1974, Vol 2, Num 4, pp 11-13Article

One of the Relations between Poetic and Formalized LanguageNEBESKY L.Poetics. 1974, Num 10, pp 27-30Article

ONE OF THE RELATIONS BETWEEN POETIC AND FORMALIZED LANGUAGENEBESKY L.POETICS. 1974, Num 10, pp 27-30Article

ON THE POTENTIALLY POETIC ASPECTS OF ARTIFICIAL LANGUAGESNEBESKY L.POETICS. 1971, Num 2, pp 87-90Article

Travaux soviétiques sur les langages informatiques En tchèqueNEBESKY L.Slovo a Slovesnost. 1975, Vol 36, Num 4, pp 347-348Article

ON THE POTENTIALLY POETIC ASPECTS OF ARTIFICIAL LANGUAGESNEBESKY L.POETICS. 1971, Num 2, pp 87-90Article

L'EMPLOI DES GRAPHES EN LINGUISTIQUE EN TCHEQUENEBESKY L.SLOVO A SLOVESNOST. 1972, Vol 33, Num 4, pp 328-331Article

ON THE POTENTIALLY POETIC ASPECTS OF ARTIFICIAL LANGUAGESNEBESKY L.POETICS. 1971, Num 2, pp 87-90Article

AN OUTERPLANAR TEST OF LINGUISTIC PROJECTIVITYNEBESKY L.1973; KYBERNETIKA; CESKOSL.; DA. 1973; VOL. 9; NO 2; PP. 81-83; BIBL. 8 REF.Serial Issue

THE MINIMUM DEGREE AND CONNECTIVITY OF A GRAPH.NEBESKY L.1978; LECTURE NOTES MATH.; GERM.; DA. 1978; NO 642; PP. 412-419; BIBL. 1 P. 1/2; (THEORY APPL. GRAPHS. INT. CONF. PROC.; KALAMAZOO; 1976)Conference Paper

AN UPPER BOUND FOR THE MINIMUM DEGREE OF A GRAPH.NEBESKY L.1977; CZECHOSL. MATH. J.; CZECHOSL.; DA. 1977; VOL. 27; NO 3; PP. 460-466; BIBL. 7 REF.Article

PROJECTIVE WEAKLY CONNECTED DIGRAPHS WITH NO DIRECTED CYCLE.NEBESKY L.1976; REV. ROUMAINE MATH. PURES APPL.; ROUMAN.; DA. 1976; VOL. 21; NO 2; PP. 215-217; BIBL. 9 REF.Article

A GENERALIZATION OF HAMILTONIAN CYCLES FOR TREES.NEBESKY L.1976; CZECHOSL. MATH. J.; CZECHOSL.; DA. 1976; VOL. 26; NO 4; PP. 596-603; ABS. RUSSE; BIBL. 5 REF.Article

ON 2-FACTORS IN SQUARES OF GRAPHSNEBESKY L.1979; CZECHOSL. MATH. J.; CSK; DA. 1979; VOL. 29; NO 4; PP. 588-594; BIBL. 8 REF.Article

ON PANCYCLIC LINE GRAPHSNEBESKY L.1978; CZECHOSL. MATH. J.; CSK; DA. 1978; VOL. 28; NO 4; PP. 650-655; BIBL. 5 REF.Article

ON THE EXISTENCE OF A 3-CONNECTED 3-FACTOR IN POWERS OF A CONNECTED GRAPH.NEBESKY L.1976; IN: GRAPHS HYPERGRAPHS BLOCK SYST. SYMP. COMB. ANAL. PROC.; ZIELONA GORA; 1976; ZIELONA GORA; DA. 1976; PP. 167-172; BIBL. 6 REF.Conference Paper

ON SQUARES OF COMPLEMENTARY GRAPHSNEBESKY L.1980; MATH. SLOV.; CSK; DA. 1980; VOL. 30; NO 3; PP. 247-249; ABS. RUS; BIBL. 11 REF.Article

EVERY CONNECTED, LOCALLY CONNECTED GRAPH IS UPPER EMBEDDABLENEBESKY L.1981; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1981; VOL. 5; NO 2; PP. 205-207; BIBL. 5 REF.Article

A NEW CHARACTERIZATION OF THE MAXIMUM, GENUS OF A GRAPHNEBESKY L.1981; CZECH. MATH. J.; ISSN 0011-4642; CSK; DA. 1981; VOL. 31; NO 4; PP. 604-613; BIBL. 17 REF.Article

ON EULERIAN SUBGRAPHS OF COMPLEMENTARY GRAPHSNEBESKY L.1979; CZECHOSL. MATH. J.; CSK; DA. 1979; VOL. 29; NO 2; PP. 298-302; BIBL. 4 REF.Article

ON THE EXISTENCE OF 1-FACTORS IN PARTIAL SQUARES OF GRAPHSNEBESKY L.1979; CZECHOSL. MATH. J.; CSK; DA. 1979; VOL. 29; NO 3; PP. 349-352; BIBL. 6 REF.Article

Sur le langage du texte mathématiqueNEBESKY, L.Slovo a Slovesnost Praha. 1984, Vol 45, Num 2, pp 121-127Article

Theme, Rheme, Support and AntithemeNEBESKY, L.Acta Universitatis Carolinae. Philologica. Linguistica Generalia. 1981, Num 3, pp 131-132Article

The Artificiality and Naturalness of the Language of MathematicsNEBESKY, L.Acta Universitatis Carolinae. Philologica. Linguistica Generalia. 1977, Num 2, pp 63-67Article

Kombinatorické vlastnosti vetnych struktur. Les propriétés combinatoires des structures de phrasesNEBESKY, L.Acta Universitatis Carolinae. Philologica. 1987, Num 95, issn 0567-8269, 197 p.Article